The diophantine equationY(Y+ 1)(Y+ 2)(Y+ 3) = 2X(X+ 1)(X+ 2)(X+ 3)
نویسندگان
چکیده
منابع مشابه
On the Diophantine Equation x^6+ky^3=z^6+kw^3
Given the positive integers m,n, solving the well known symmetric Diophantine equation xm+kyn=zm+kwn, where k is a rational number, is a challenge. By computer calculations, we show that for all integers k from 1 to 500, the Diophantine equation x6+ky3=z6+kw3 has infinitely many nontrivial (y≠w) rational solutions. Clearly, the same result holds for positive integers k whose cube-free part is n...
متن کاملThe Exponential Diophantine Equation 2x + by = cz
Let b and c be fixed coprime odd positive integers with min{b, c} > 1. In this paper, a classification of all positive integer solutions (x, y, z) of the equation 2 (x) + b (y) = c (z) is given. Further, by an elementary approach, we prove that if c = b + 2, then the equation has only the positive integer solution (x, y, z) = (1,1, 1), except for (b, x, y, z) = (89,13,1, 2) and (2 (r) - 1, r + ...
متن کاملThe diophantine equation x3 3 + y3 + z 3 − 2xyz = 0
We will be presenting two theorems in this paper. The first theorem, which is a new result, is about the non-existence of integer solutions of the cubic diophantine equation. In the proof of this theorem we have used some known results from theory of binary cubic forms and the method of infinite descent, which are well understood in the purview of Elementary Number Theory(ENT). In the second th...
متن کاملON SOLVING THE DIOPHANTINE EQUATION x 3 + y 3 + z 3 = k ON A VECTOR COMPUTER
Recently, the first author has proposed a new algorithm for solving the Diophantine equation x3 + y3 + z3 = k , where k is a given nonzero integer. In this paper we present the detailed versions of this algorithm for some values of k given below, and we describe how we have optimized and run the algorithm on a Cyber 205 vector computer. A vectorized version of the Euclidean algorithm was writte...
متن کاملON THE DIOPHANTINE EQUATION x 4 − q 4 = py 3
In this paper we study the Diophantine equation x4−q4 = py, with the following conditions: p and q are prime distincts natural numbers, x is not divisible with p, p ≡ 11 (mod12), q ≡ 1 (mod3), p is a generator of the group ( Zq , · ) , 2 is a cubic residue mod q.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1971
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1971.37.331